The purpose of the traffic assignment problem is to obtain a traffic flow\udpattern given a set of origin-destination travel demands and flow dependent link performance functions of a road network. In the general case, the traffic assignment\udproblem can be formulated as a variational inequality, and several algorithms have\udbeen devised for its efficient solution. In this work we propose a new approach that\udcombines two existing procedures: the master problem of a simplicial decomposition\udalgorithm is solved through the analytic center cutting plane method. Four variants\udare considered for solving the master problem. The third and fourth ones, which\udheuristically compute an appropriate initial point, provided the best results. The computational experience reported in the solution of real large-scale diagonal and difficult asymmetric problems—including a subset of the transportation networks of Madrid and Barcelona—show the effectiveness of the approach.
展开▼
